منابع مشابه
Timed Temporal Logics
Since the early 1990’s, classical temporal logics have been extended with timing constraints. While temporal logics only express contraints on the order of events, their timed extensions can add quantitative constraints on delays between those events. We survey expressiveness and algorithmic results on those logics, and discuss semantic choices that may look unimportant but do have an impact on...
متن کاملModel-checking Timed Temporal Logics
In this paper, we present several timed extensions of temporal logics, that can be used for model-checking real-time systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results.
متن کاملLogics For Context { Free
We deene matchings, and show that they capture the essence of context{freeness. More precisely, we show that the class of context{ free languages coincides with the class of those sets of strings which can be deened by sentences of the form 9 b', where ' is rst order, b is a binary predicate symbol, and the range of the second order quantiier is restricted to the class of matchings. Several var...
متن کاملModel-Checking for Extended Timed Temporal Logics
We introduce the real-time temporal logic BTATL p which is obtained by extending CTL with both past operators and timed automata constraints. Considering together past operators and automata constraints allows expressing timing requirements in a simple and natural way. Model-checking for full BTATL p is undecidable. Fortunately, there exist signiicant (both linear-time and branching-time) fragm...
متن کاملTimed Temporal Logics for Abstracting Transient States
In previous work, the timed logic TCTL was extended with an “almost everywhere” Until modality which abstracts negligible sets of positions (i.e. with a null duration) along a run of a timed automaton. We propose here an extension of this logic with more powerful modalities, in order to specify properties abstracting transient states, which are events that last for less than k time units. Our m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.277.17